A New Approach Based on Centrality Value in Solving the Maximum Independent Set Problem: Malatya Centrality Algorithm

Graph structure is widely used to describe problems in different fields. Problems many areas, such as security and transportation, are among them. The can be solved using approaches similar the graph structure. independent set problem, which NP-Complete one of main theory modeling problems. implementation Independent problem with most significant possible number nodes called Maximum set. A lot algorithm approach proposed solve problem. This study proposes an effective for maximum occurs two steps: computing Malatya centrality value determining In first step, values computed forming algorithm. any sum ratios node's degree neighboring nodes' degrees. second step determine selected Here, node minimum added Then, edges this node, its adjacent nodes, subtracted from graph. By repeating new calculations, all vertexes deleted so that determined. It observed on sample provides effecient solution Successful test results analyzes denonstrate effectiveness approach.